A cut locus for finite graphs and the farthest point mapping
نویسندگان
چکیده
منابع مشابه
A cut locus for finite graphs and the farthest point mapping
We reflect upon an analogue of the cut locus, a notion classically studied in Differential Geometry, for finite graphs. The cut locus C(x) of a vertex x shall be the graph induced by the set of all vertices y with the property that no shortest path between x and z, z 6= y, contains y. The cut locus coincides with the graph induced by the vertices realizing the local maxima of the distance funct...
متن کاملCut locus structures on graphs
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
متن کاملMin-Cut Methods for Mapping Dataflow Graphs
High performance applications and the underlying hardware platforms are becoming increasingly dynamic; runtime changes in the behavior of both are likely to result in inappropriate mappings of tasks to parallel machines during application execution. This fact is prompting new research on mapping and scheduling the dataaow graphs that represent parallel applications. In contrast to recent resear...
متن کاملOrientable cut locus structures on graphs
We showed in [4] that every connected graph can be realized as the cut locus of some point on some riemannian surface S. Here, criteria for the orientability of S are given, and are applied to classify the distinct, orientable, cut locus structures on graphs with four generating cycles. Math. Subj. Classification (2000): — 53C22, 05C10
متن کاملNetwork Farthest-Point Diagrams
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network distance. Within this metric space, we study farthest points. We introduce network farthest-point diagrams, which capture how the farthest points—and the distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.08.003